Simple, fast, and scalable reachability oracle
نویسندگان
چکیده
منابع مشابه
Simple, Fast, and Scalable Reachability Oracle
A reachability oracle (or hop labeling) assigns each vertex v two sets of vertices: Lout(v) and Lin(v), such that u reaches v iff Lout(u) ∩ Lin(v) 6= ∅. Despite their simplicity and elegance, reachability oracles have failed to achieve efficiency in more than ten years since their introduction: The main problem is high construction cost, which stems from a set-cover framework and the need to ma...
متن کاملAn Optimal Dual Fault Tolerant Reachability Oracle
Let G = (V,E) be an n-vertices m-edges directed graph. Let s ∈ V be any designated source vertex. We address the problem of reporting the reachability information from s under two vertex failures. We show that it is possible to compute in polynomial time an O(n) size data structure that for any query vertex v, and any pair of failed vertices f1, f2, answers in O(1) time whether or not there exi...
متن کاملVEBAV - A Simple, Scalable and Fast Authorship Verification Scheme
We present VEBAV a simple, scalable and fast authorship verification scheme for the Author Identification (AI) task within the PAN-2014 competition. VEBAV (VEctor-Based Authorship Verifier), which is a modification of our existing PAN-2013 approach, is an intrinsic one-class-verification method, based on a simple distance function. VEBAV provides a number of benefits as for instance the indepen...
متن کاملShared-Memory Parallelism Can Be Simple, Fast, and Scalable
Parallelism is the key to achieving high performance in computing. However, writing efficient and scalable parallel programs is notoriously difficult, and often requires significant expertise. To address this challenge, it is crucial to provide programmers with high-level tools to enable them to develop solutions efficiently, and at the same time emphasize the theoretical and practical aspects ...
متن کاملFast Reachability Query Processing
Graph has great expressive power to describe the complex relationships among data objects, and there are large graph datasets available. In this paper, we focus ourselves on processing a primitive graph query. We call it reachability query. The reachability query, denoted A D, is to find all elements of a type D that are reachable from some elements in another type A. The problem is challenging...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2013
ISSN: 2150-8097
DOI: 10.14778/2556549.2556578